Uniqueness of User Equilibrium in Transportation Networks with Heterogeneous Commuters
نویسنده
چکیده
This paper discusses uniqueness of user equilibrium in transportation networks with heterogeneous commuters. Daganzo (1983, Transportation Science) proved the uniqueness of (stochastic) user equilibrium when commuters have heterogeneous tastes over possible paths but identical disutility functions from time costs. We Þrst show, by example, that his result may not apply in general networks if disutility functions are allowed to differ. However, for simple transportation networks, we show that user equilibrium is always unique and weakly Pareto efficient (cf. the Braess example) for a general class of utility functions. We investigate if this result applies to more general networks. We also show that user equilibrium is unique in a dynamic bottleneck model with a simple network. We discuss an interesting relationship between the following two problems: the existence of user equilibrium in a Þnite model and the uniqueness of user equilibrium in a continuum model. In the appendix, we also provide a proof of a slightly generalized version of Daganzos theorem.
منابع مشابه
Commuting Pattern with Park-and-Ride Option for Heterogeneous Commuters
We study the effect of the parking on heterogeneous commuters’ travel choice in a competitive transportation systemwhich consists of a subway and a parallel road with a bottleneck of limited service capacity. Everymorning, commuters either use their private cars only or drive their cars to the bottleneck, park there, and then take the subway to the destination. Considering the effects caused by...
متن کاملUser-based Vehicle Route Guidance in Urban Networks Based on Intelligent Multi Agents Systems and the ANT-Q Algorithm
Guiding vehicles to their destination under dynamic traffic conditions is an important topic in the field of Intelligent Transportation Systems (ITS). Nowadays, many complex systems can be controlled by using multi agent systems. Adaptation with the current condition is an important feature of the agents. In this research, formulation of dynamic guidance for vehicles has been investigated based...
متن کاملDifferent Network Performance Measures in a Multi-Objective Traffic Assignment Problem
Traffic assignment algorithms are used to determine possible use of paths between origin-destination pairs and predict traffic flow in network links. One of the main deficiencies of ordinary traffic assignment methods is that in most of them one measure (mostly travel time) is usually included in objective function and other effective performance measures in traffic assignment are not considere...
متن کاملA Second Order Stochastic Network Equilibrium Model, I: Theoretical Foundation
Existing models of stochastic network equilibrium route choice in transport networks are able to represent exogenously-specified variations in drivers’ actual or perceived travel costs, but assume throughout that flows are deterministic. In this paper, a new notion of equilibrium is presented based on stochastic flow variables, in which the impact of variable flows on the variability in travel ...
متن کاملMethods of Reducing the Number of Effective ODs in Order to Solve Traffic Equilibrium Problem in Real Life Networks
Solving traffic equilibrium problem, or “traffic assignment”, as the last step in Transportation Planning, distributes OD trip demands of a transportation network over the network links with regard to Traffic Equilibrium Law, and estimates the link flows. In formulations of traffic equilibrium which are based on path saving, the memory consumption is considerably affected by the number of effct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Transportation Science
دوره 38 شماره
صفحات -
تاریخ انتشار 2004